A New Heuristic Algorithm for Unit Commitment Problem
نویسنده
چکیده
Large scale power systems Unit Commitment (UC) is a complicated, hard limit, mixed integer combinatorial and nonlinear optimization problem with many constraints. This paper presents an innovative and effective solution based on modification of the Harmony Search (HS) Algorithm to solve the strategic planning of Generating unit's commitment. The proposed algorithm is easy in application compared to the other Evolutionary Methods (EM) and has a high capability in reaching to optimal solution with reasonable time. The proposed method is tested using the reported problem data sets. Simulations were down for daily unit commitment. The results are compared with previous reported articles results. Numerical results show the efficiency and improvement of the solution in cost and execution time compared to the results of the other powerful heuristic optimization algorithms.
منابع مشابه
Smart Grid Unit Commitment with Considerations for Pumped Storage Units Using Hybrid GA-Heuristic Optimization Algorithm
A host of technologies has been developed to achieve these aims of the smart grid. Some of these technologies include plug-in electric vehicle, demand response program, energy storage system and renewable distributed generation. However, the integration of the smart grid technologies in the power system operation studies such as economic emission unit commitment problem causes two major challen...
متن کاملAn adaptive modified firefly algorithm to unit commitment problem for large-scale power systems
Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off. In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...
متن کاملOptimal Scheduled Unit Commitment Considering Wind Uncertainty Using Cuckoo Search Algorithm
In this paper, a new method to review the role of wind units as an energy-producer in the scheduling problem of unit commitment is presented. Today, renewable energy sources due to lack of environmental pollution, absence of dependence on fossil fuels, and consequently a very low marginal cost, have been receiving considerable attention in power system. But these sources are associated with unc...
متن کاملA New Hybrid Heuristic Technique for Unit Commitment and Generation Scheduling
This paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. A modified objective function associated with a new start-up cost term is introduced in this paper. The proposed method is used to solve generating scheduling problem satisfying SRR, minimum up and down time as well as ramp rate constraints. Two case studies are conducted to imp...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملThe Effects of Electricity Boiler on Integrated CCHP-Thermal-Heat Only Unit Commitment Problem Based on Hybrid GA Approach
Combined cooling, heat, and power (CCHP) units can be integrated with conventional separate cooling, heat, and power production units to meet demands. The goal of this study is to develop and examine a hybrid GA-heuristic optimization algorithm for solving the unit commitment problem for integrated CCHP-thermal-heat only system with considerations for electricity boiler. When environmental emis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012